Simple mechanisms for subadditive buyers via duality

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

متن کامل

Implementation of Bargaining Sets via Simple Mechanisms

We propose two simple mechanisms that implement two bargaining sets in super-additive environments. The first bargaining set is a close variation of the one Ž . proposed by L. Zhou 1994, Games Econom. Beha ̈. 6, 512]526 , and the second is Ž the Pareto optimum payoffs of the A. Mas-Colell 1989, J. Math. Econom. 18, . 129]139 bargaining set. We adopt a simple framework in which the cooperative ou...

متن کامل

Kingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem

A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.

متن کامل

A Note on Simple Duality

Certain spaces satisfying Poincare duality are shown to have the homotopy type of simple Poincare complexes. The motivation for and applications of this result are the study of free actions of finite groups on manifolds. Let X be a finite CW complex with finite fundamental group ir. Then X is an n-dimensional Poincare complex if there is a class [X] E H, (X) such that the slant product with the...

متن کامل

Minimization via Duality

We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata. The basic idea is that instead of constructing a maximal quotient we go to the dual and look for a minimal subalgebra and then return to the original category. Duality ensures that the mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGecom Exchanges

سال: 2019

ISSN: 1551-9031

DOI: 10.1145/3331033.3331037